On the Logic of Factual Equivalence
نویسنده
چکیده
Say that two sentences are factually equivalent when they describe the same facts or situations, understood as worldly items, i.e. as bits of reality rather than as representations of reality. The notion of factual equivalence is certainly of central interest to philosophical semantics, but it plays a role in a much wider range of philosophical areas. What is the logic of factual equivalence? This paper attempts to give a partial answer to this question, by providing an answer the following, more specific question: Given a standard propositional language with negation, conjunction and disjunction as primitive operators, which sentences of the language should be taken to be factually equivalent by virtue of their logical form? The system for factual equivalence advocated in this paper is a proper fragment of the first-degree system for the logic of analytic equivalence put forward in the late seventies by R. B. Angell. I provide the system with two semantics, both formulated in terms of the notion of a situation’s being fittingly described by a linguistic item. In the final part of the paper I argue, contra a view I defended in my “Grounding and Truth-Functions” (2010), that the logic for factual equivalence I advocate here should be preferred to Angell’s logic if one wishes to follow the general conception of the relationships between factual equivalence and the notion of grounding put forward in the 2010 paper.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملComprehension of factual, nonfactual, and counterfactual conditionals by Iranian EFL learners
A considerable amount of studies have been established on conditional reasoning supporting mental model theory of propositional reasoning. Mental model theory proposed by Johnson- larid and Byrne is an explanation of someone's thought process about how something occurs in the real world. Conditional reasoning as a kind of reasoning is the way to speak about possibilities or probabilities. The a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Rew. Symb. Logic
دوره 9 شماره
صفحات -
تاریخ انتشار 2016